General Context-Free Recognition in Less than Cubic Time
نویسنده
چکیده
An algorithm for general context-free recognition is given that re3 quires less than n time asymptotically fox input strings of length n.
منابع مشابه
Parsing by matrix multiplication generalized to Boolean grammars
The well-known parsing algorithm for context-free grammars due to Valiant (“General context-free recognition in less than cubic time”, Journal of Computer and System Sciences, 10:2 (1975), 308–314) is analyzed and extended to handle the more general Boolean grammars, which are context-free grammars augmented with conjunction and negation operators in the rules. The algorithm reduces constructio...
متن کاملDynamic Programming with Convexity, Concavity, and Sparsity
A fast algorithm for computing longest common subse-quences. [J82] Johnson, D. B. A priority queue in which initialization and queue operations take O(log log D) Pattern recognition in nucleic acid sequences II: an ecient method for nding locally stable secondary structures. A simple linear time algorithm for concave one-dimensional dynamic programming. preprint, 1990. almost linear time algori...
متن کاملAn Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to the language generated by the grammar. A closely related problem of great importance is one where the input are a string I and a grammar G and the task is to produce a string I ′ that belongs to the language generate...
متن کاملConvex Surface Visualization Using Rational Bi- cubic Function
The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...
متن کاملTree Insertion Grammar: Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-free languages and TIGs have the same cubic-time worst-case complexity bounds for recognition and parsing as context-free grammars. An efficient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 10 شماره
صفحات -
تاریخ انتشار 1975